Dimer covering and percolation frustration
نویسندگان
چکیده
منابع مشابه
Dimer covering and percolation frustration.
Covering a graph or a lattice with nonoverlapping dimers is a problem that has received considerable interest in areas, such as discrete mathematics, statistical physics, chemistry, and materials science. Yet, the problem of percolation on dimer-covered lattices has received little attention. In particular, percolation on lattices that are fully covered by nonoverlapping dimers has not evidentl...
متن کامل“Ising anyons in frustration-free Majorana-dimer models”
Dimer models have long been a fruitful playground for understanding topological physics. We introduce a new class of dimer models -termed Majorana-dimer models -where the dimers represent pairs of Majorana modes, to capture the physics of strongly interacting Majoranas. We find that the simplest examples of such systems realize an intriguing, intrinsically fermionic phase of matter that can be ...
متن کاملPERCOLATION, FIRST-PASSAGE PERCOLATION, AND COVERING TIMES FOR RICHARDSON’S MODEL ON THE n-CUBE
Percolation with edge-passage probability p and first-passage percolation are studied for the n-cube Bn = {0, 1} with nearest neighbor edges. For oriented and unoriented percolation, p = e/n and p = 1/n are the respective critical probabilities. For oriented first-passage percolation with i.i.d. edge-passage times having a density of 1 near the origin, the percolation time (time to reach the op...
متن کاملCovering Algorithms, Continuum Percolation and the Geometry of Wireless Networks
Continuum percolation models where each point of a two-dimensional Poisson point process is the center of a disc of given (or random) radius r, have been extensively studied. In this paper, we consider the generalization in which a deterministic algorithm (given the points of the point process) places the discs on the plane, in such a way that 1 each disc covers at least one point of the point ...
متن کاملPERCOLATION, FIRST-PASSAGE PERCOLATION, AND COVERING TIMES FOR RICHARDSON’S MODEL ON THE n-CUBE
Percolation with edge-passage probability p and first-passage percolation are studied for the n-cube Bn = {0, 1}n with nearest neighbor edges. For oriented and unoriented percolation, p = e/n and p = 1/n are the respective critical probabilities. For oriented first-passage percolation with i.i.d. edge-passage times having a density of 1 near the origin, the percolation time (time to reach the o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review E
سال: 2015
ISSN: 1539-3755,1550-2376
DOI: 10.1103/physreve.92.032134